Stepwise Adaptation of Weights for Symbolic Regression with Genetic Programming
نویسندگان
چکیده
In this paper we continue study on the Stepwise Adaptation of Weights (saw) technique. Previous studies on constraint satisfaction and data classification have indicated that saw is a promising technique to boost the performance of evolutionary algorithms. Here we use saw to boost performance of a genetic programming algorithm on simple symbolic regression problems. We measure the performance of a standard gp and two variants of saw extensions on two different symbolic regression problems.
منابع مشابه
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm on simple symbolic regression problems. We measure the performance of a standard gp and two variants of saw extensions on two different symbolic regression problems from literature. Also, we propose a model for randomly generati...
متن کاملGenetic Programming with Historically Assessed Hardness
We present a variation of the genetic programming algorithm, called Historically Assessed Hardness (HAH), in which the fitness rewards for particular test cases are scaled in proportion to their relative difficulty as gauged by historical solution rates. The method is similar in many respects to some realizations of techniques such as implicit fitness sharing, stepwise adaptation of weights and...
متن کاملShuffled Frog-Leaping Programming for Solving Regression Problems
There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...
متن کاملNumeric Mutation: Improved Search in Genetic Programming
Genetic programming is relatively poor at discovering useful numeric constants for the terminal nodes of its sexpression trees. In this paper we outline an adaptation to genetic programming, called numeric mutation. ~,Ve provide empirical evidence and analysis that demonstrate that numeric mutation makes a statistically significant increase in genetic programming’s performance for symbolic regr...
متن کاملEstimating scour below inverted siphon structures using stochastic and soft computing approaches
This paper uses nonlinear regression, Artificial Neural Network (ANN) and Genetic Programming (GP) approaches for predicting an important tangible issue i.e. scours dimensions downstream of inverted siphon structures. Dimensional analysis and nonlinear regression-based equations was proposed for estimation of maximum scour depth, location of the scour hole, location and height of the dune downs...
متن کامل